Termination Proof Script

Consider the TRS R consisting of the rewrite rules
1:    min(X,0)  → X
2:    min(s(X),s(Y))  → min(X,Y)
3:    quot(0,s(Y))  → 0
4:    quot(s(X),s(Y))  → s(quot(min(X,Y),s(Y)))
5:    log(s(0))  → 0
6:    log(s(s(X)))  → s(log(s(quot(X,s(s(0))))))
There are 5 dependency pairs:
7:    MIN(s(X),s(Y))  → MIN(X,Y)
8:    QUOT(s(X),s(Y))  → QUOT(min(X,Y),s(Y))
9:    QUOT(s(X),s(Y))  → MIN(X,Y)
10:    LOG(s(s(X)))  → LOG(s(quot(X,s(s(0)))))
11:    LOG(s(s(X)))  → QUOT(X,s(s(0)))
The approximated dependency graph contains 3 SCCs: {7}, {8} and {10}. Hence the TRS is terminating.
Tyrolean Termination Tool  (0.03 seconds)   ---  May 3, 2006